Optimization of the Beampattern of 2D Sparse Arrays by Weighting
نویسنده
چکیده
A method is presented which optimizes weights of general planar 1D and 2D symmetric full and sparse arrays. The objective is to nd a weighting of the array elements which gives the minimum sidelobe level of the array pattern in a speci ed region the stopband. The sidelobe level is controlled on a discrete set of points from this region. The method minimizes the Chebyshev norm of the sidelobe level. The method is based on linear programming and is solved with the simplex method. The method removes the large uctuation in sidelobe level which characterizes random sparse arrays. Examples of optimal weighted 1D and 2D planar arrays are presented.
منابع مشابه
Experience with sparse arrays at the University of Oslo
This paper gives an overview over work on layout and weight optimization of sparse 1D and 2D arrays which has been done over the last decade. The optimization methods have been linear programming, genetic methods and simulated annealing. The latter is our preferred method. The paper shows examples of optimized arrays on Cartesian and nonCartesian grids such as polar and hex. Non-planar arrays (...
متن کاملWeight- and Layout-Optimized Sparse Arrays
Theory for random arrays predicts a mean sidelobe level given by the inverse of the number of elements. In this paper two optimization methods for thinned arrays are given: one is for optimizing the weights of each element, and the other one optimizes both the layout and the weights. The weight optimization algorithm is based on linear programming and minimizes the peak sidelobe level for a giv...
متن کاملAntenna array pattern synthesis via convex optimization
We show that a variety of antenna array pattern synthesis problems can be expressed as convex optimization problems, which can be (numerically) solved with great eeciency by recently developed interior-point methods. The synthesis problems involve arrays with arbitrary geometry and element directivity, constraints on far and near eld patterns over narrow or broad frequency bandwidth, and some i...
متن کاملOptimal Reconfiguration of Solar Photovoltaic Arrays Using a Fast Parallelized Particle Swarm Optimization in Confront of Partial Shading
Partial shading reduces the power output of solar modules, generates several peak points in P-V and I-V curves and shortens the expected life cycle of inverters and solar panels. Electrical array reconfiguration of PV arrays that is based on changing the electrical connections with switching devices, can be used as a practical solution to prevent such problems. Valuable studies have been perfor...
متن کاملAntenna Array Pattern Synthesis via Convex Optimization - Signal Processing, IEEE Transactions on
We show that a variety of antenna array pattern synthesis problems can be expressed as convex optimization problems, which can be (numerically) solved with great efficiency by recently developed interior-point methods. The synthesis problems involve arrays with arbitrary geometry and element directivity, constraints on farand near-field patterns over narrow or broad frequency bandwidth, and som...
متن کامل